Sanjeev Khanna
   HOME

TheInfoList



OR:

Sanjeev Khanna is an
Indian-American Indian Americans or Indo-Americans are citizens of the United States with ancestry from India. The United States Census Bureau uses the term Asian Indian to avoid confusion with Native Americans, who have also historically been referred to ...
computer scientist A computer scientist is a person who is trained in the academic study of computer science. Computer scientists typically work on the theoretical side of computation, as opposed to the hardware side on which computer engineers mainly focus (al ...
. He is currently a
Henry Salvatori Henry Salvatori (March 28, 1901 – July 6, 1997) was an American geophysicist, businessman, philanthropist, and political activist. Salvatori founded Western Geophysical in 1933 and, after selling the company in 1960, pursued a second caree ...
professor of Computer and Information Science at the
University of Pennsylvania The University of Pennsylvania (also known as Penn or UPenn) is a private research university in Philadelphia. It is the fourth-oldest institution of higher education in the United States and is ranked among the highest-regarded universitie ...
. His research interests include
approximation algorithm In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solu ...
s,
hardness of approximation In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems. Scope Hardness of approximation complements the study of approximation algorithms by prov ...
,
combinatorial optimization Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combi ...
, and sublinear algorithms.


Career

Khanna received his undergraduate degrees in computer science and economics from
Birla Institute of Technology and Science Birla Institute of Technology & Science, Pilani (BITS Pilani) is a Deemed university in Pilani, Jhunjhunu, India. It focuses primarily on higher education and research in engineering and sciences. After expansion to a campus in Dubai, it has b ...
, Pilani, India in 1990, his M.S. degree in computer science from
University of Illinois at Urbana-Champaign The University of Illinois Urbana-Champaign (U of I, Illinois, University of Illinois, or UIUC) is a public land-grant research university in Illinois in the twin cities of Champaign and Urbana. It is the flagship institution of the Univ ...
in 1992, and his doctoral degree in computer science from
Stanford University Stanford University, officially Leland Stanford Junior University, is a private research university in Stanford, California. The campus occupies , among the largest in the United States, and enrolls over 17,000 students. Stanford is consider ...
,
California California is a U.S. state, state in the Western United States, located along the West Coast of the United States, Pacific Coast. With nearly 39.2million residents across a total area of approximately , it is the List of states and territori ...
, US in 1996. He joined
University of Pennsylvania The University of Pennsylvania (also known as Penn or UPenn) is a private research university in Philadelphia. It is the fourth-oldest institution of higher education in the United States and is ranked among the highest-regarded universitie ...
in 1999 after spending three years as a member of the Mathematical Sciences Research center at
Bell Laboratories Nokia Bell Labs, originally named Bell Telephone Laboratories (1925–1984), then AT&T Bell Laboratories (1984–1996) and Bell Labs Innovations (1996–2007), is an American industrial research and scientific development company owned by mult ...
.


Research contribution and awards

Khanna's primary research contributions are to the fields of
approximation algorithm In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solu ...
s,
hardness of approximation In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems. Scope Hardness of approximation complements the study of approximation algorithms by prov ...
,
combinatorial optimization Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combi ...
, and sublinear algorithms. His doctoral work at Stanford University, "A Structural View of Approximation", received the 1996
Arthur Samuel Arthur Lee Samuel (December 5, 1901 – July 29, 1990) was an American pioneer in the field of computer gaming and artificial intelligence. He popularized the term "machine learning" in 1959. The Samuel Checkers-playing Program was among the wo ...
prize for the best PhD dissertation in the Computer Science Department. He is a
Guggenheim Fellow Guggenheim Fellowships are grants that have been awarded annually since by the John Simon Guggenheim Memorial Foundation to those "who have demonstrated exceptional capacity for productive scholarship or exceptional creative ability in the ar ...
(2007) and a
Sloan Fellow The Sloan Fellows program is the world's first mid-career and senior career master's degree in general management and leadership. It was initially supported by a grant from Alfred P. Sloan, the late CEO of General Motors, to his alma mater, MI ...
(2000). He is also a recipient of S. Reid Warren, Jr. and Lindback awards for distinguished teaching at University of Pennsylvania. He serves on the Editorial board of Foundations and Trends in Theoretical Computer Science, and has previously served on the editorial boards of
SICOMP The ''SIAM Journal on Computing'' is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published by the Society for Industrial and Applied Mathematics (SIAM). Although its official ISO abbreviation i ...
, ACM TALG,
Algorithmica ''Algorithmica'' is a monthly peer-reviewed scientific journal focusing on research and the application of computer science algorithms. The journal was established in 1986 and is published by Springer Science+Business Media. The editor in chief is ...
, JCSS, and as an area editor for
Encyclopaedia of Algorithms An encyclopedia (American English) or encyclopædia (British English) is a reference work or compendium providing summaries of knowledge either general or special to a particular field or discipline. Encyclopedias are divided into articles ...
. In 2018, the Association for Computing Machinery named him an
ACM Fellow ACM or A.C.M. may refer to: Aviation * AGM-129 ACM, 1990–2012 USAF cruise missile * Air chief marshal * Air combat manoeuvring or dogfighting * Air cycle machine * Arica Airport (Colombia) (IATA: ACM), in Arica, Amazonas, Colombia Computing * ...
for his contributions to approximation algorithms, hardness of approximation, and sublinear algorithms.


External links


Sanjeev Khanna's Home PageDBLP: Sanjeev Khanna


References

* American computer scientists Living people 20th-century births Sloan Research Fellows University of Pennsylvania faculty Fellows of the Association for Computing Machinery Year of birth missing (living people) {{Compu-scientist-stub